Ant System for the k-Cardinality Tree Problem
نویسندگان
چکیده
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on pheromone with a weight based greedy local optimization. Experimental results on a large set of problem instances show that this algorithm matches or surpasses other algorithms including an ant colony optimization algorithm, a tabu search algorithm, an evolutionary algorithm and a greedy-based algorithm on all but one of the 138 tested instances.
منابع مشابه
Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem
Research efforts in metaheuristics have shown that an intelligent incorporation of more classical optimization techniques in metaheuristics can be very beneficial. In this paper, we combine the metaheuristic ant colony optimization with dynamic programming for the application to the NP-hard k-cardinality tree problem. Given an undirected graph G with node and/or edge weights, the problem consis...
متن کاملAnt Colony Optimization For The Edge-weighted k-cardinality Tree Problem
In this paper we deal with an NP -hard combinatorial optimization problem, the kcardinality tree problem in edge-weighted graphs. This problem has several applications in practice, which justify the need for eÆcient methods to obtain good solutions. Metaheuristic applications have already been shown to be successful in tackling the kcardinality tree problem in the past. In this paper we propose...
متن کاملNew metaheuristic approaches for the edge-weighted k-cardinality tree problem
In this paper we propose three metaheuristic approaches, namely a Tabu Search, an Evolutionary Computation and an Ant Colony Optimization approach, for the edge-weighted k-cardinality tree (KCT) problem. This problem is an NP-hard combinatorial optimization problem that generalizes the well-known minimum weight spanning tree problem. Given an edge-weighted graph G = (V; E), it consists of /ndin...
متن کاملA hybridization of evolutionary fuzzy systems and ant Colony optimization for intrusion detection
A hybrid approach for intrusion detection in computer networks is presented in this paper. The proposed approach combines an evolutionary-based fuzzy system with an Ant Colony Optimization procedure to generate high-quality fuzzy-classification rules. We applied our hybrid learning approach to network security and validated it using the DARPA KDD-Cup99 benchmark data set. The results indicate t...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کامل